A Multi-Objective Genetic Algorithm for the Vehicle Routing with Time Windows and Loading Problem
نویسنده
چکیده
This work presents the Vehicle Routing with Time Windows and Loading Problem (VRTWLP) as a multi-objective optimization problem, implemented within a Genetic Algorithm. Specifically, the three dimensions of the problem to be optimized – the number of vehicles, the total travel distance and volume utilization – are considered to be separated dimensions of a multiobjective space. The quality of the solution obtained using this approach is evaluated and compared with results of other heuristic approaches previously developed by the author. The most significant contribution of this work is our interpretation of VRTWLP as a Multi-objective Optimization Problem.
منابع مشابه
A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows
This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملSolving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
متن کاملA Goal Programming Model for Single Vehicle Routing Problem with Multiple Routes
The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...
متن کامل